Factor Widths of Nonnegative Matrices
نویسندگان
چکیده
Factor widths of nonnegative integral positive semidefinite square matrices are investigated. The nonnegative factor width, the exact factor width and the binary factor width of such matrices are introduced. Some lower and upper bounds for these widths are obtained. Nonnegative symmetric (completely positive) matrices with some given nonnegative (binary) factor widths
منابع مشابه
On the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کاملA Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization
This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...
متن کاملA Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization
This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...
متن کاملFast Nonnegative Matrix Tri-Factorization for Large-Scale Data Co-Clustering
NonnegativeMatrix Factorization (NMF) based coclustering methods have attracted increasing attention in recent years because of their mathematical elegance and encouraging empirical results. However, the algorithms to solve NMF problems usually involve intensive matrix multiplications, which make them computationally inefficient. In this paper, instead of constraining the factor matrices of NMF...
متن کاملPERRON-FROBENIUS THEORY ON THE NUMERICAL RANGE FOR SOME CLASSES OF REAL MATRICES
We give further results for Perron-Frobenius theory on the numericalrange of real matrices and some other results generalized from nonnegative matricesto real matrices. We indicate two techniques for establishing the main theorem ofPerron and Frobenius on the numerical range. In the rst method, we use acorresponding version of Wielandt's lemma. The second technique involves graphtheory.
متن کامل